On the covering radius of long binary BCH codes

More on the covering radius of BCH codes

New lower bounds on the minimum length of terror correcting BCH codes with covering radius at most 2t are derived.

On the covering radius of some binary cyclic codes

We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.

On the Covering Radius of Long Goppa Codes

On the duals of binary BCH codes

We give bounds for the minimal distance of duals of binary BCH codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.

On the covering radius of codes

Designing a good error-correcting code is a packing problem. The corresponding covering problem has received much less attention: now the codewords must be placed so that no vector of the space is very far from the nearest codeword. The two problems are quite different, and with a few exceptions good packings, i.e. codes with a large minimal distance, are usually not especially good coverings. ...